Covering arrays: new generalizations for software testing applications Organizers:

Covering arrays are combinatorial designs that are used for testing systems such as software, circuits and networks, where failures can be caused by the interaction between their components or parameters. New generalizations of these objects employ techniques from design theory, graph homomorphisms, combinatorial group testing, among other fields. This minisymposium highlights current research that addresses some of the challenges that arise in real testing situations. Models under study incorporate graphs and hypergraphs to select relevant interactions to be tested, specification of forbidden interactions, and the ability to locate faulty interactions. This session will be closed by a talk discussing empirical data from applications and other challenges to be faced.